Efficient (t, n) Secret Sharing Scheme against Cheating
نویسندگان
چکیده
A (t, n) secret sharing (SS) scheme can be divided into two protocols: share generation protocol and secret reconstruction protocol. In share generation protocol, a mutually trusted dealer selects a secret and distributes shares to shareholders secretly; in secret reconstruction protocol, a group of t qualified shareholders pool their shares together to reconstruct the secret. However, in secret reconstruction protocol, dishonest shareholders (i.e., cheaters) can pool forged shares to fool honest shareholders. By this way, the cheaters can recover the legitimate secret exclusively, and the honest shareholders get nothing but a fake secret. In this paper, we propose a (t, n)SS that is capable of detecting such cheating fact efficiently. Our scheme is an extension of Shamir’s (t, n)SS that uses a symmetric bivariate polynomial. In addition, our scheme adopts no security assumption, it is unconditional secure.
منابع مشابه
Security Analysis of a Hash-Based Secret Sharing Scheme
Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملA Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions
A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...
متن کاملAn Efficient Robust Secret Sharing Scheme with Optimal Cheater Resiliency
In this paper, we consider the problem of (t, δ) robust secret sharing secure against rushing adversary. We design a simple t-out-ofn secret sharing scheme, which can reconstruct the secret in presence of t cheating participants except with probability at most δ, provided t < n/2. The later condition on cheater resilience is optimal for the case of public reconstruction of the secret, on which ...
متن کاملAn improvement on the Lin-Wu (t, n) threshold verifiable multi-secret sharing scheme
Lin and Wu [IEE Proc. Comput. Digit. Tech. 146 (1999) 264] have proposed an efficient ðt; nÞ threshold verifiable multi-secret sharing (VMSS) scheme based on the factorization problem and the discrete logarithm modulo a large composite problem. In their scheme, the dealer can arbitrarily give any set of multiple secrets to be shared, and only one reusable secret shadow is to be kept by every pa...
متن کامل